Supplement to “ Strategic Learning and the Topology of Social Networks ” : Examples
نویسندگان
چکیده
IN THIS SUPPLEMENT, we give two examples showing that the assumptions of bounded out-degree and L-connectedness are crucial. Our approach in constructing equilibria will be to prescribe the initial moves of the agents and then extend this to an equilibrium strategy profile. Define the set of times and histories agents have to respond to as H = {(i t a) : i ∈ V t ∈ N0 a ∈ [0 1] × {0 1}|N(i)|·t}. The set [0 1] × {0 1}|N(i)|·t is interpreted as the pair of the private belief of i and the history of actions observed by agent i up to time t. If a ∈ [0 1] × {0 1}|N(i)|·t , then for 0 ≤ t ′ ≤ t, we let at′ ∈ [0 1] × {0 1}|N(i)|·t denote the history restricted to times up to t ′. We say that a subset H⊆H is history-closed if, for every (i t a) ∈H, we have that for all 0 ≤ t ′ ≤ t that (i t ′ at′) ∈H. For a strategy profile Q̄, denote the optimal expected utility for i under any response as u i (Q̄)= supR̄ ui(R̄), where the supremum is over strategy profiles R̄ such that R =Qj for all j = i in V .
منابع مشابه
Strategic Learning and the Topology of Social Networks by Elchanan Mossel,
We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals and by observing the actions of their neighbors in a social network. We show that the question of whether or not the agents learn efficiently depends on the topology of the social network. In particular, we identify a g...
متن کاملStrategic Learning and the Topology of Social Networks
We consider a Bayesian game of pure informational externalities, in which a group of agents learn a binary state of the world from conditionally independent private signals, by repeatedly observing the actions of their neighbors in a social network. We show that the question of whether or not the agents learn the state of the world depends on the topology of the social network. In particular, w...
متن کاملMulticast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کامل